Extension of fuzzy Johnson algorithm to three machines fuzzy flow-shop scheduling problem
نویسندگان
چکیده
منابع مشابه
Electromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and tardiness
In this paper, we study a flow shop batch processing machines scheduling problem. The fuzzy due dates are considered to make the problem more close to the reality. The objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. In order to tackle the given problem, we propose a hybrid electromagnetism-like (EM) algorithm, in which the EM is hybridized with a diversi...
متن کاملPerformance Measures of Flow Shop Scheduling on Parallel Machines in Fuzzy and Non Fuzzy Environment
In the previous chapter, we have made an analytical study regarding the completion time and the due time of each job, in order to find out the satisfaction level of demand maker in a flow shop scheduling. But this chapter differs in the study that here each job has to process on equi potential parallel machines at first stage and then on other succeeding machines in a specified order. Some addi...
متن کاملTwo-Machine Fuzzy Flow Shop Scheduling Using Black Hole Algorithm
Flow shop scheduling of jobs has always been a popular problem that has found solutions in the number of heuristic and meta-heuristic techniques. In this manuscript, two-machine flow shop scheduling problem has been investigated while optimizing makespan and idle time of machines. Uncertainties in the processing time and set up times of jobs involved are also taken into consideration in the for...
متن کاملelectromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and tardiness
in this paper, we study a flow shop batch processing machines scheduling problem. the fuzzy due dates are considered to make the problem more close to the reality. the objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. in order to tackle the given problem, we propose a hybrid electromagnetism-like (em) algorithm, in which the em is hybridized with a diversi...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2019
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0703/0038